A Linear Algorithm for Embedding of Cycles in Crossed Cubes with Edge-Pncyclic
نویسندگان
چکیده
A cycle structure is a fundamental network for multiprocessor systems and suitable for developing simple algorithms with low communication cost. Many efficient algorithms were designed with respect to cycles for solving a variety of algebraic problems, graph problems, and some parallel applications, such as those in image and signal processing [2, 16]. To carry out a cycle-structure algorithm on a multiprocessor computer or a distributed system, the processes of the parallel algorithm need to be mapped to the nodes of the interconnection network in the system such that any two adjacent processes in the cycle are mapped to two adjacent nodes of the network. Besides, to execute a parallel program efficiently, the size of the allocated cycle must accord to the problem size. Thus, many researchers focus their studies on how to embed cycles of different sizes into an interconnection network. In distributed systems, each node and each edge may be assigned with distinct resource and distinct bandwidth, respectively. For this purpose, it is meaningful to study the problem of how to embed cycles into a network such that these cycles pass through a special node/edge. The crossed cube proposed by Efe [6] is one of the most notable variations of hypercube, but some properties of the former are superior to those of the latter. For example, the diameter of the crossed cube is almost the half of that of the hypercube. With regard to cycles embedding of crossed cubes, many interesting results have received considerable attention [1, 3-5, 7-15, 18-20]. Finding cycles of arbitrary length passing through any given edge in crossed cubes has attracted special attention from researchers. In this paper, we consider the problem of embedding a cycle of arbitrary numbers of nodes that passes through a given edge on the crossed cube. A concept, cycle pattern, is in use to construct an efficient algorithm for embedding a desired cycle with arbitrary given edge into the crossed cube. Furthermore,
منابع مشابه
Edge Congestion and Topological Properties of Crossed Cubes
An dimensional crossed cube, CQ,,, is a variation of hypercubes. in this paper, we give a new shortest path routing algorithm based on a new distance measure defined hsreln. In comparison with Efe's algorithm, which generates one shortest path in O(ri2) time, our algorithm can generate more shortest paths in O ( n ) time. Based on a given shortest path routing algorithm, we consider a new perfo...
متن کاملA systematic approach for finding Hamiltonian cycles with a prescribed edge in crossed cubes
The crossed cube is one of the most notable variations of hypercube, but some properties of the former are superior to those of the latter. For example, the diameter of the crossed cube is almost the half of that of the hypercube. In this paper, we focus on the problem embedding a Hamiltonian cycle through an arbitrary given edge in the crossed cube. We give necessary and sufficient condition f...
متن کاملThe property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
The presence of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traffic to be spread evenly across the network. Edge-disjoint Hamiltonian cycles also provide the edge-fault tolerant hamiltonicity of an interconnection network. In this paper, we first study the property of edge-disjoint Hamiltonian cycles in tr...
متن کاملEmbeddings into Crossed Cubes
The hypercube parallel architecture is one of the most popular interconnection networks due to many of its attractive properties and its suitability for general purpose parallel processing. An attractive version of the hypercube is the crossed cube. It preserves the important properties of the hypercube and most importantly reduces the diameter by a factor of two. In this paper, we show the abi...
متن کاملEmbedding Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles into Twisted Cubes
The presence of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traffic to be spread evenly across the network. Edge-disjoint Hamiltonian cycles also provide the edge-fault tolerant Hamiltonicity of an interconnection network. Two node-disjoint cycles in a network are called equal if the number of nodes in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 31 شماره
صفحات -
تاریخ انتشار 2015